Set-oriented Numerical Computation of Rotation Sets
نویسندگان
چکیده
We establish a set-oriented algorithm for the numerical approximation of the rotation set of homeomorphisms of the two-torus homotopic to the identity. A theoretical background is given by the concept of ε-rotation sets. These are obtained by replacing orbits with ε-pseudo-orbits in the definition of the Misiurewicz-Ziemian rotation set and are shown to converge to the latter as ε decreases to zero. Based on this result, we prove the convergence of the numerical approximations as precision and iteration time tend to infinity. Further, we provide analytic error estimates for the algorithm under an additional boundedness assumption, which is known to hold in many relevant cases and in particular for non-empty interior rotation sets. 2010 MSC numbers. Primary: 65P99, Secondary: 37M25, 37E45
منابع مشابه
Oriented Bounding Box Computation Using Particle Swarm Optimization
The problem of finding the optimal oriented bounding box (OBB) for a given set of points in R 3 , yet simple to state, is computa-tionally challenging. Existing state-of-the-art methods dealing with this problem are either exact but slow, or fast but very approximative and unreliable. We propose a method based on Particle Swarm Optimization (PSO) to approximate solutions both effectively and ac...
متن کاملMore On λκ−closed sets in generalized topological spaces
In this paper, we introduce λκ−closed sets and study its properties in generalized topological spaces.
متن کاملA Rigorous Numerical Method for the Global Analysis of Infinite-Dimensional Discrete Dynamical Systems
We present a numerical method to prove certain statements about the global dynamics of infinite dimensional maps. The method combines set-oriented numerical tools for the computation of invariant sets and isolating neighborhoods, the Conley index theory and analytic considerations. It not only allows for the detection of a certain dynamical behaviour, but also for a precise computation of the c...
متن کاملAdaptive Set-Oriented Computation of Topological Horseshoe Factors in Area and Volume Preserving Maps
We describe an automatic chaos verification scheme based on set oriented numerical methods, which is especially well suited to the study of area and volume preserving diffeomorphisms. The novel feature of the scheme is an iterative algorithm for approximating connecting orbits between collections of hyperbolic fixed and periodic points with greater and greater accuracy. The algorithm is geometr...
متن کاملA topological method for rigorously computing periodic orbits using Fourier modes
We present a technique for the rigorous computation of periodic orbits in certain ordinary differential equations. The method combines set oriented numerical techniques for the computation of invariant sets in dynamical systems with topological index arguments. It not only allows for the proof of existence of periodic orbits but also for a precise (and rigorous) approximation of these. As an ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017